Harder-narasimhan Filtrations and K-groups of an Elliptic Curve
نویسنده
چکیده
Let X be an elliptic curve over an algebraically closed field. We prove that some exact sub-categories of the category of vector bundles over X, defined using Harder-Narasimhan filtrations, have the same K-groups as the whole category.
منابع مشابه
Harder-Narasimhan categories
We propose a generalization of Quillen’s exact category — arithmetic exact category and we discuss conditions on such categories under which one can establish the notion of Harder-Narasimhan filtrations and Harder-Narsimhan polygons. Furthermore, we show the functoriality of Harder-Narasimhan filtrations (indexed by R), which can not be stated in the classical setting of Harder and Narasimhan’s...
متن کاملHermitian-einstein Inequalities and Harder-narasimhan Filtrations
Unstable holomorphic bundles can be described algebraically by HarderNarasimhan filtrations. In this note we show how such filtrations correspond to the existence of special metrics defined by Hermitian-Einstein inequalities.
متن کاملStratifications of Parameter Spaces for Complexes by Cohomology Types
We study a collection of stability conditions (in the sense of Schmitt) for complexes of sheaves over a smooth complex projective variety indexed by a positive rational parameter. We show that the Harder–Narasimhan filtration of a complex for small values of this parameter encodes the Harder– Narasimhan filtrations of the cohomology sheaves of this complex. Finally we relate a stratification in...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملAn efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کامل